Sequential Approximate Multiobjective Optimization Using Computational Intelligence

نویسندگان

  • Min Yoon
  • Yeboon Yun
  • Hirotaka Nakayama
چکیده

In many practical problems, in particular in engineering design, the function form of criteria is not given explicitly in terms of design variables. Given the value of design variables, under this circumstance, the value of objective functions is obtained by real/computational experiments such as structural analysis, fluidmechanic analysis, thermodynamic analysis, and so on. Usually, these experiments are time consuming and expensive. One of recent trends in optimization is how to treat these expensive criteria. In order to make the number of these experiments as few as possible, optimization is performed in parallel with predicting the form of objective functions. This is called sequential approximate optimization with meta-modeling. It has been observed that techniques of computational intelligence can be effectively applied for this purpose. This talk will discuss several issues in sequential approximate multiobjective optimization using computational intelligence.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Sequential Approximate Multiobjective Optimization Using Computational Intelligence - Preamble

Die Online-Fachbuchhandlung beck-shop.de ist spezialisiert auf Fachbücher, insbesondere Recht, Steuern und Wirtschaft. Im Sortiment finden Sie alle Medien (Bücher, Zeitschriften, CDs, eBooks, etc.) aller Verlage. Ergänzt wird das Programm durch Services wie Neuerscheinungsdienst oder Zusammenstellungen von Büchern zu Sonderpreisen. Der Shop führt mehr als 8 Millionen Produkte.

متن کامل

Sequential Optimality Conditions and Variational Inequalities

In recent years, sequential optimality conditions are frequently used for convergence of iterative methods to solve nonlinear constrained optimization problems. The sequential optimality conditions do not require any of the constraint qualications. In this paper, We present the necessary sequential complementary approximate Karush Kuhn Tucker (CAKKT) condition for a point to be a solution of a ...

متن کامل

TECHNISCHE UNIVERSITÄT DORTMUND REIHE COMPUTATIONAL INTELLIGENCE COLLABORATIVE RESEARCH CENTER 531 Design and Management of Complex Technical Processes and Systems by means of Computational Intelligence Methods Analysis of a Simple Evolutionary Algorithm for the Multiobjective Shortest Path Problem

We present a natural fitness function f for the multiobjective shortest path problem, which is a fundamental multiobjective combinatorial optimization problem known to be NP-hard. Thereafter, we conduct a rigorous runtime analysis of a simple evolutionary algorithm (EA) optimizing f . Interestingly, this simple general algorithm is a fully polynomial-time randomized approximation scheme (FPRAS)...

متن کامل

An algorithm for approximating nondominated points of convex multiobjective optimization problems

‎In this paper‎, ‎we present an algorithm for generating approximate nondominated points of a multiobjective optimization problem (MOP)‎, ‎where the constraints and the objective functions are convex‎. ‎We provide outer and inner approximations of nondominated points and prove that inner approximations provide a set of approximate weakly nondominated points‎. ‎The proposed algorithm can be appl...

متن کامل

Recent Developments of Computational Intelligence for Resource Constrained Project Scheduling Problems: A Taxonomy and Review

This article presents a broad overview of applications of Computational Intelligence (CI) paradigms in resource constrained project scheduling problems (RCPSP) including Fuzzy system (FS), Artificial Neural Networks (ANN), Particle Swarm Optimization (PSO), Tabu Search (TS), Genetic Algorithms (GA), Simulated Annealing (SA) and other metaheuristics techniques. Recent developments of computation...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2009